Short Message Noisy Network Coding with Rate Splitting
نویسندگان
چکیده
For noisy network with multiple relays, short message noisy network coding with rate splitting (SNNC-RS) scheme is presented. It has recently been shown by Hou and Kramer that mixed cooperative strategies in which relays in favorable positions decode-and-forward (DF) and the rest quantize via short message noisy network coding (SNNC) can outperform existing cooperative strategies (e.g., noisy network coding (NNC) and decode-and-forward). A drawback of such schemes is that forwarding of quantized signals at SNNC relays introduces interference to the rest of the relays. Our proposed relaying scheme has a capability to reduce such interference and thereby improve the rate performance. In the proposed scheme, superposition coding is incorporated into SNNC encoding to enable partial interference cancellation at DF relays. The achievable rate with proposed scheme is derived for the discrete two-relay network and evaluated in the Gaussian case where gains over the rate achievable without rate splitting are demonstrated.
منابع مشابه
Short Message Noisy Network Coding With a Decode-Forward Option
Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where ...
متن کاملAchievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملCoding for Relay Networks and Effective Secrecy for Wire-tap Channels
This thesis addresses two problems of network information theory: coding for relay networks and (accurate) approximations of distributions based on unnormalized informational divergence with applications to network security. For the former problem, we first consider short message noisy network coding (SNNC). SNNC differs from long message noisy network coding (LNNC) in that one transmits many s...
متن کاملOn Compress-Forward without Wyner-Ziv Binning for Relay Networks
Noisy network coding is recently proposed for the general multi-source network by Lim, Kim, El Gamal and Chung. This scheme builds on compress-forward (CF) relaying but involves three new ideas, namely no Wyner-Ziv binning, relaxed simultaneous decoding and message repetition. In this paper, using the two-way relay channel as the underlining example, we analyze the impact of each of these ideas...
متن کاملCoding Schemes for the Two-Way Relay Channels
In modern transmission networks, relay plays an important role for cooperative strategies. Several relaying strategies, such as decode-forward, compress-forward and amplify-forward, have been proposed for relay channels and networks. However, the capacity for the general relay channel and network is still unknown. In this thesis, we propose several relay schemes for different relay models. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1404.0061 شماره
صفحات -
تاریخ انتشار 2014